Uncertainty orders on the sublinear expectation space
نویسندگان
چکیده
منابع مشابه
Constructing Sublinear Expectations on Path Space
We provide a general construction of time-consistent sublinear expectations on the space of continuous paths. It yields the existence of the conditional G-expectation of a Borel-measurable (rather than quasi-continuous) random variable, a generalization of the random Gexpectation, and an optional sampling theorem that holds without exceptional set. Our results also shed light on the inherent li...
متن کاملFunctional Programming in Sublinear Space
We consider the problem of functional programming with data in external memory, in particular as it appears in sublinear space computation. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot compose functions directly for lack of space for the intermediate result, but must instead compute and recomput...
متن کاملSome Remarks on the Space of Differences of Sublinear Functions
Two properties concerning the space of differences of sublinear functions D(X) for a real Banach space X are proved. First, we show that for a real separable Banach space (X, ‖ · ‖) there exists a countable family of seminorms such that D(X) becomes a Fréchet space. For X = R this construction yields a norm such that D(R) becomes a Banach space. Furthermore, we show that for a real Banach space...
متن کاملType Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming language with primitives that support the implementation of such algorithms. We have shown that IntML can express all LOGSPACE functions but have left open the question how easy it is in practice to program typical LOGSPACE...
متن کاملSublinear-Space Distance Labeling Using Hubs
We propose a labeling scheme for unweighted undirected graphs, that is an assignment of binary labels to vertices of a graph such that the distance between any pair of vertices can be decoded solely from their labels. Recently, Alstrup et al. [3] have shown a labeling scheme for sparse graphs with labels of size O( n D log D) where D = logn log m+n n . We present a simpler approach achieving si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2016
ISSN: 2391-5455
DOI: 10.1515/math-2016-0023